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 listMay 12, 2026 00:58Josu San MartinJosu San MartinScore: 4,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:594,16742,039,30133,556,0001,035,0002,113,536
2May 12, 2026 00:594,18942,827,34033,703,0001,072,0002,113,536
3May 12, 2026 00:594,19042,342,30033,724,0001,056,0002,113,536
4May 12, 2026 00:594,20343,349,54633,847,0001,041,0002,113,536
5May 12, 2026 00:594,22242,663,16233,997,0001,052,0002,113,536
6May 12, 2026 00:594,22844,367,28234,044,0001,052,0002,113,536
7May 12, 2026 00:594,22843,377,56634,031,0001,063,0002,113,536
8May 12, 2026 00:594,26644,250,35034,351,0001,059,0002,113,536
9May 12, 2026 00:597,61773,139,08862,163,0001,065,0002,113,536