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 15, 2026 23:11Victor MerckléVictor MerckléScore: 6,958Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:116,95266,931,21756,693,0001,009,0002,113,536
2May 15, 2026 23:116,95365,045,54456,715,0001,003,0002,113,536
3May 15, 2026 23:116,95765,068,51356,729,0001,018,0002,113,536
4May 15, 2026 23:116,95865,093,22456,719,0001,040,0002,113,536
5May 15, 2026 23:116,95871,200,03156,734,0001,023,0002,113,536
6May 15, 2026 23:116,96266,692,54356,758,0001,032,0002,113,536
7May 15, 2026 23:116,98565,509,99756,977,0001,003,0002,113,536
8May 15, 2026 23:116,98967,477,05356,892,0001,121,0002,113,536
9May 15, 2026 23:117,02768,530,64257,317,0001,012,0002,113,536