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 12:32Victor MerckléVictor MerckléScore: 3,857Success
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 12:323,82140,731,16430,452,0001,265,0002,113,536
2Aug 27, 2026 12:323,82739,932,45630,523,0001,248,0002,113,536
3Aug 27, 2026 12:323,83940,153,44730,838,0001,029,0002,113,536
4Aug 27, 2026 12:323,84640,206,84730,910,0001,016,0002,113,536
5Aug 27, 2026 12:323,85741,565,01730,742,0001,279,0002,113,536
6Aug 27, 2026 12:323,89741,415,04331,075,0001,275,0002,113,536
7Aug 27, 2026 12:323,96241,865,08831,608,0001,281,0002,113,536
8Aug 27, 2026 12:324,04042,590,24032,346,0001,187,0002,113,536
9Aug 27, 2026 12:324,07543,498,55932,615,0001,212,0002,113,536