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 22:19Josu San MartinJosu San MartinScore: 8,257Success
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 22:208,08776,431,11563,912,0003,218,0002,113,536
2Jul 3, 2026 22:208,15677,088,75064,504,0003,194,0002,113,536
3Jul 3, 2026 22:208,19377,407,82964,717,0003,293,0002,113,536
4Jul 3, 2026 22:208,20977,506,90564,950,0003,185,0002,113,536
5Jul 3, 2026 22:208,25777,946,08765,389,0003,148,0002,113,536
6Jul 3, 2026 22:208,34378,589,26466,042,0003,208,0002,113,536
7Jul 3, 2026 22:208,40979,251,96966,690,0003,108,0002,113,536
8Jul 3, 2026 22:208,53480,114,76567,593,0003,245,0002,113,536
9Jul 3, 2026 22:208,89583,121,08470,665,0003,166,0002,113,536