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 16, 2026 01:10Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:11067,545,82657,235,0001,002,0002,113,536expected "53688394362534594 ", got "53688392058534594 "
2May 16, 2026 01:116,94866,646,92856,671,0001,005,0002,113,536
3May 16, 2026 01:116,95068,427,03556,682,0001,006,0002,113,536
4May 16, 2026 01:116,95165,799,08356,689,0001,006,0002,113,536
5May 16, 2026 01:116,95164,984,69957,694,00002,113,536
6May 16, 2026 01:116,96067,573,46256,750,0001,021,0002,113,536
7May 16, 2026 01:116,96267,270,41356,772,0001,014,0002,113,536
8May 16, 2026 01:116,96565,147,15856,706,0001,110,0002,113,536
9May 16, 2026 01:116,97065,192,13956,833,0001,018,0002,113,536