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 11, 2026 01:32Victor MerckléVictor MerckléScore: 3,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 01:333,94241,082,13331,562,0001,159,0002,117,632stderr
2Aug 11, 2026 01:333,94340,853,95031,567,0001,168,0002,117,632stderr
3Aug 11, 2026 01:333,94641,027,59731,563,0001,192,0002,117,632stderr
4Aug 11, 2026 01:333,96641,077,39331,806,0001,119,0002,117,632stderr
5Aug 11, 2026 01:333,98841,721,65531,893,0001,214,0002,117,632stderr
6Aug 11, 2026 01:334,01841,552,40532,220,0001,132,0002,117,632stderr
7Aug 11, 2026 01:334,04541,753,86932,562,0001,017,0002,117,632stderr
8Aug 11, 2026 01:334,05841,890,33732,570,0001,118,0002,117,632stderr
9Aug 11, 2026 01:334,07842,047,50332,631,0001,221,0002,117,632stderr