Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 14, 2026 11:33Victor MerckléVictor MerckléScore: 3,570Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 11:363,49239,448,25127,982,0001,009,0002,117,632stderr
2Sep 14, 2026 11:363,49638,815,88428,004,0001,017,0002,117,632stderr
3Sep 14, 2026 11:363,50439,485,17728,062,0001,027,0002,117,632stderr
4Sep 14, 2026 11:363,57039,372,91828,621,0001,013,0002,117,632stderr
5Sep 14, 2026 11:363,57040,125,57328,626,0001,009,0002,117,632stderr
6Sep 14, 2026 11:363,57439,536,73328,655,0001,011,0002,117,632stderr
7Sep 14, 2026 11:363,58639,612,42828,745,0001,021,0002,117,632stderr
8Sep 14, 2026 11:363,59340,488,13028,756,0001,068,0002,117,632stderr
9Sep 14, 2026 11:363,59940,437,27828,858,0001,020,0002,117,632stderr