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 15:14Alexander StanovoyAlexander StanovoyScore: 39,449Success
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 15:1438,726331,141,916320,320,0001,106,0002,113,536
2Jul 8, 2026 15:1439,263336,213,838324,694,0001,190,0002,113,536
3Jul 8, 2026 15:1439,430337,002,052326,093,0001,178,0002,113,536
4Jul 8, 2026 15:1439,433337,338,261326,199,0001,099,0002,113,536
5Jul 8, 2026 15:1439,449337,254,617326,177,0001,256,0002,113,536
6Jul 8, 2026 15:1439,762340,399,907328,818,0001,207,0002,113,536
7Jul 8, 2026 15:1440,264343,956,319332,934,0001,261,0002,113,536
8Jul 8, 2026 15:1440,322344,422,271333,532,0001,144,0002,113,536
9Jul 8, 2026 15:1440,328344,453,411333,626,0001,102,0002,113,536