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 listMay 24, 2026 11:36Victor MerckléVictor MerckléScore: 6,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:366,38261,975,19851,908,0001,066,0002,113,536
2May 24, 2026 11:366,38662,929,87551,946,0001,063,0002,113,536
3May 24, 2026 11:366,38863,007,36251,950,0001,072,0002,113,536
4May 24, 2026 11:366,38862,773,37651,964,0001,062,0002,113,536
5May 24, 2026 11:366,39061,316,55651,971,0001,072,0002,113,536
6May 24, 2026 11:366,42161,614,16552,277,0001,025,0002,113,536
7May 24, 2026 11:366,44062,403,27852,372,0001,080,0002,113,536
8May 24, 2026 11:366,62064,468,70253,922,0001,032,0002,113,536
9May 24, 2026 11:366,66365,389,89654,301,0001,002,0002,113,536