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 10, 2026 19:11Victor MerckléVictor MerckléScore: 3,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 19:143,47637,227,84127,734,0001,117,0002,117,632stderr
2Sep 10, 2026 19:143,51637,617,02128,181,0001,007,0002,117,632stderr
3Sep 10, 2026 19:143,52138,467,72528,215,0001,012,0002,117,632stderr
4Sep 10, 2026 19:143,53637,948,56528,229,0001,125,0002,117,632stderr
5Sep 10, 2026 19:143,53738,722,59128,202,0001,159,0002,117,632stderr
6Sep 10, 2026 19:143,54538,263,26728,275,0001,156,0002,117,632stderr
7Sep 10, 2026 19:143,55038,156,41928,347,0001,122,0002,117,632stderr
8Sep 10, 2026 19:143,56138,913,33228,420,0001,143,0002,117,632stderr
9Sep 10, 2026 19:143,56138,229,87428,419,0001,145,0002,117,632stderr