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 06:47Victor MerckléVictor MerckléScore: 3,788Success
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 06:483,77340,430,20430,303,0001,018,0002,117,632stderr
2Aug 12, 2026 06:483,77639,892,47030,101,0001,248,0002,117,632stderr
3Aug 12, 2026 06:483,78239,879,90230,169,0001,226,0002,117,632stderr
4Aug 12, 2026 06:483,78439,830,30230,181,0001,233,0002,117,632stderr
5Aug 12, 2026 06:483,78839,923,08730,254,0001,189,0002,117,632stderr
6Aug 12, 2026 06:483,80339,959,49930,471,0001,097,0002,117,632stderr
7Aug 12, 2026 06:483,81340,098,09330,630,0001,021,0002,117,632stderr
8Aug 12, 2026 06:483,81640,047,41230,582,0001,096,0002,117,632stderr
9Aug 12, 2026 06:483,89840,790,75131,262,0001,092,0002,117,632stderr