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 07:44Victor MerckléVictor MerckléScore: 4,506Success
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 07:454,45145,397,23435,872,0001,072,0002,117,632stderr
2Aug 27, 2026 07:454,45945,321,58035,938,0001,078,0002,117,632stderr
3Aug 27, 2026 07:454,47245,500,88336,055,0001,070,0002,117,632stderr
4Aug 27, 2026 07:454,47345,487,93936,024,0001,104,0002,117,632stderr
5Aug 27, 2026 07:454,50645,818,55936,307,0001,100,0002,117,632stderr
6Aug 27, 2026 07:454,56446,228,28036,798,0001,086,0002,117,632stderr
7Aug 27, 2026 07:454,58546,430,73136,970,0001,090,0002,117,632stderr
8Aug 27, 2026 07:454,62046,690,33237,257,0001,097,0002,117,632stderr
9Aug 27, 2026 07:454,63746,809,60337,401,0001,090,0002,117,632stderr