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 listJul 8, 2026 23:38Victor MerckléVictor MerckléScore: 65,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:414,10742,220,09833,089,0001,005,0002,117,632stderr
2Jul 8, 2026 23:414,13642,237,06133,279,0001,051,0002,117,632stderr
3Jul 8, 2026 23:414,15742,626,60833,379,0001,126,0002,117,632stderr
4Jul 8, 2026 23:4165,823554,456,713545,222,0001,115,0002,117,632stderr
5Jul 8, 2026 23:4165,867554,757,125545,586,0001,111,0002,117,632stderr
6Jul 8, 2026 23:4166,517561,676,978551,044,0001,050,0002,117,632stderr
7Jul 8, 2026 23:4166,608560,940,521551,750,0001,101,0002,117,632stderr
8Jul 8, 2026 23:4166,612561,066,576551,739,0001,142,0002,117,632stderr
9Jul 8, 2026 23:4166,789562,582,653553,348,0001,004,0002,117,632stderr