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 27, 2026 01:49Victor MerckléVictor MerckléScore: 4,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:504,22343,435,99833,914,0001,142,0002,117,632stderr
2Aug 27, 2026 01:504,23243,545,83933,980,0001,150,0002,117,632stderr
3Aug 27, 2026 01:504,24743,630,43134,176,0001,077,0002,117,632stderr
4Aug 27, 2026 01:504,25043,638,49834,147,0001,131,0002,117,632stderr
5Aug 27, 2026 01:504,29744,723,71434,528,0001,143,0002,117,632stderr
6Aug 27, 2026 01:504,44145,239,58535,759,0001,104,0002,117,632stderr
7Aug 27, 2026 01:504,49245,636,61336,174,0001,110,0002,117,632stderr
8Aug 27, 2026 01:504,51545,866,59736,377,0001,100,0002,117,632stderr
9Aug 27, 2026 01:504,55646,275,50036,689,0001,128,0002,117,632stderr