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 18:39Josu San MartinJosu San MartinScore: 34,044Success
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 18:3933,732289,326,281275,208,0004,774,0002,113,536
2Jul 3, 2026 18:3933,767289,705,239275,517,0004,755,0002,113,536
3Jul 3, 2026 18:3933,893290,677,849276,524,0004,788,0002,113,536
4Jul 3, 2026 18:3933,969291,245,977277,132,0004,813,0002,113,536
5Jul 3, 2026 18:3934,044291,964,487277,656,0004,917,0002,113,536
6Jul 3, 2026 18:3934,075292,166,847277,933,0004,895,0002,113,536
7Jul 3, 2026 18:3934,102292,357,898278,380,0004,673,0002,113,536
8Jul 3, 2026 18:3934,121292,617,674278,296,0004,915,0002,113,536
9Jul 3, 2026 18:3934,244293,571,462279,359,0004,873,0002,113,536