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:20Josu San MartinJosu San MartinScore: 6,416Success
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:216,23261,049,75848,713,0003,016,0002,113,536
2Jul 4, 2026 00:216,25561,262,81749,844,0002,079,0002,113,536
3Jul 4, 2026 00:216,27361,468,26149,994,0002,075,0002,113,536
4Jul 4, 2026 00:216,28161,524,84050,094,0002,046,0002,113,536
5Jul 4, 2026 00:216,41662,588,35650,188,0003,071,0002,113,536
6Jul 4, 2026 00:216,48963,197,52550,838,0003,028,0002,113,536
7Jul 4, 2026 00:216,52563,574,46651,112,0003,050,0002,113,536
8Jul 4, 2026 00:216,55563,806,05951,333,0003,080,0002,113,536
9Jul 4, 2026 00:217,79974,111,49061,681,0003,054,0002,113,536