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 29, 2026 16:36Josu San MartinJosu San MartinScore: 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 29, 2026 16:404,47645,520,71736,118,0001,034,0002,113,536
2Aug 29, 2026 16:404,47945,573,96636,157,0001,024,0002,113,536
3Aug 29, 2026 16:404,50045,780,03936,228,0001,125,0002,113,536
4Aug 29, 2026 16:404,50245,820,42036,240,0001,130,0002,113,536
5Aug 29, 2026 16:404,50645,806,75336,294,0001,109,0002,113,536
6Aug 29, 2026 16:404,50645,875,78936,289,0001,115,0002,113,536
7Aug 29, 2026 16:404,51045,862,74136,330,0001,110,0002,113,536
8Aug 29, 2026 16:404,51045,824,08736,350,0001,085,0002,113,536
9Aug 29, 2026 16:404,51047,086,04436,322,0001,111,0002,113,536