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 13, 2026 00:37Victor MerckléVictor MerckléScore: 9,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 00:389,35388,489,66076,534,0001,096,0002,113,536
2May 13, 2026 00:389,35688,239,09576,550,0001,107,0002,113,536
3May 13, 2026 00:389,36487,393,09876,534,0001,190,0002,113,536
4May 13, 2026 00:389,36488,461,13776,547,0001,178,0002,113,536
5May 13, 2026 00:389,36988,224,89576,583,0001,187,0002,113,536
6May 13, 2026 00:389,36987,812,31176,764,0001,005,0002,113,536
7May 13, 2026 00:389,37289,654,43776,783,0001,005,0002,113,536
8May 13, 2026 00:389,38588,532,44376,768,0001,129,0002,113,536
9May 13, 2026 00:389,40587,243,11876,902,0001,166,0002,113,536