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 4, 2026 00:43Josu San MartinJosu San MartinScore: 5,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:435,30053,272,01040,803,0003,194,0002,113,536
2Jul 4, 2026 00:435,32153,548,94940,958,0003,210,0002,113,536
3Jul 4, 2026 00:435,33453,647,76540,990,0003,283,0002,113,536
4Jul 4, 2026 00:435,33653,339,59841,051,0003,238,0002,113,536
5Jul 4, 2026 00:435,38162,362,77041,474,0003,189,0002,113,536
6Jul 4, 2026 00:435,43554,637,54041,785,0003,327,0002,113,536
7Jul 4, 2026 00:435,44254,557,06741,844,0003,326,0002,113,536
8Jul 4, 2026 00:435,49654,998,36042,503,0003,115,0002,113,536
9Jul 4, 2026 00:435,54355,353,55642,675,0003,333,0002,113,536