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 21:42Victor MerckléVictor MerckléScore: 4,959Success
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 21:444,83848,547,84839,109,0001,054,0002,117,632stderr
2Aug 11, 2026 21:444,84648,615,68539,110,0001,112,0002,117,632stderr
3Aug 11, 2026 21:444,90649,166,94139,631,0001,094,0002,117,632stderr
4Aug 11, 2026 21:444,90849,112,81239,722,0001,016,0002,117,632stderr
5Aug 11, 2026 21:444,95950,744,33140,127,0001,033,0002,117,632stderr
6Aug 11, 2026 21:444,97550,332,50640,175,0001,119,0002,117,632stderr
7Aug 11, 2026 21:445,02150,151,64540,579,0001,101,0002,117,632stderr
8Aug 11, 2026 21:445,13851,061,09841,548,0001,100,0002,117,632stderr
9Aug 11, 2026 21:445,47653,835,64844,437,0001,020,0002,117,632stderr