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 3, 2026 20:55Josu San MartinJosu San MartinScore: 6,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:556,35763,457,36548,543,0004,226,0002,113,536
2Jul 3, 2026 20:556,37062,218,69148,555,0004,320,0002,113,536
3Jul 3, 2026 20:556,37262,264,73048,684,0004,204,0002,113,536
4Jul 3, 2026 20:556,38862,361,50148,867,0004,155,0002,113,536
5Jul 3, 2026 20:556,40562,555,62649,038,0004,124,0002,113,536
6Jul 3, 2026 20:556,41662,625,87648,974,0004,280,0002,113,536
7Jul 3, 2026 20:556,44062,774,58949,084,0004,370,0002,113,536
8Jul 3, 2026 20:556,44362,812,05349,354,0004,124,0002,113,536
9Jul 3, 2026 20:556,45662,889,62049,337,0004,249,0002,113,536