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 08:09Victor MerckléVictor MerckléScore: 3,826Success
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 08:103,77639,750,05030,203,0001,141,0002,117,632stderr
2Aug 12, 2026 08:103,78439,879,93530,269,0001,143,0002,117,632stderr
3Aug 12, 2026 08:103,79039,840,00230,348,0001,112,0002,117,632stderr
4Aug 12, 2026 08:103,80440,075,44330,488,0001,087,0002,117,632stderr
5Aug 12, 2026 08:103,82640,111,61630,665,0001,096,0002,117,632stderr
6Aug 12, 2026 08:103,85440,371,11830,918,0001,071,0002,117,632stderr
7Aug 12, 2026 08:103,86340,490,15130,984,0001,083,0002,117,632stderr
8Aug 12, 2026 08:103,92941,583,71431,460,0001,156,0002,117,632stderr
9Aug 12, 2026 08:104,01141,852,82532,220,0001,077,0002,117,632stderr