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 listAug 12, 2026 02:32Victor MerckléVictor MerckléScore: 3,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 02:333,73339,446,53229,828,0001,158,0002,117,632stderr
2Aug 12, 2026 02:333,74439,483,07229,943,0001,139,0002,117,632stderr
3Aug 12, 2026 02:333,76339,678,79030,108,0001,126,0002,117,632stderr
4Aug 12, 2026 02:333,79339,825,16830,365,0001,119,0002,117,632stderr
5Aug 12, 2026 02:333,84340,173,41630,816,0001,082,0002,117,632stderr
6Aug 12, 2026 02:333,86040,471,99230,902,0001,140,0002,117,632stderr
7Aug 12, 2026 02:333,94441,279,88331,660,0001,079,0002,117,632stderr
8Aug 12, 2026 02:333,98941,522,05732,011,0001,101,0002,117,632stderr
9Aug 12, 2026 02:334,01641,726,54432,259,0001,081,0002,117,632stderr