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 28, 2026 22:12Victor MerckléVictor MerckléScore: 3,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 22:123,74639,457,62329,949,0001,149,0002,117,632stderr
2Aug 28, 2026 22:123,75939,510,16430,026,0001,177,0002,117,632stderr
3Aug 28, 2026 22:123,77640,443,25930,204,0001,141,0002,117,632stderr
4Aug 28, 2026 22:123,79439,867,90430,394,0001,098,0002,117,632stderr
5Aug 28, 2026 22:123,80439,661,19430,473,0001,102,0002,117,632stderr
6Aug 28, 2026 22:123,83040,972,72530,631,0001,158,0002,117,632stderr
7Aug 28, 2026 22:123,83340,033,03930,727,0001,092,0002,117,632stderr
8Aug 28, 2026 22:123,83840,002,16830,755,0001,108,0002,117,632stderr
9Aug 28, 2026 22:123,89840,749,23731,196,0001,159,0002,117,632stderr