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 14, 2026 04:28Victor MerckléVictor MerckléScore: 7,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 04:287,01267,387,45258,205,00002,113,536
2May 14, 2026 04:287,01468,610,57058,220,00002,113,536
3May 14, 2026 04:287,01567,349,52457,223,0001,007,0002,113,536
4May 14, 2026 04:287,01666,127,33557,217,0001,021,0002,113,536
5May 14, 2026 04:287,01966,301,40757,250,0001,012,0002,113,536
6May 14, 2026 04:287,02466,113,50857,293,0001,009,0002,113,536
7May 14, 2026 04:287,02467,378,50857,301,0001,003,0002,113,536
8May 14, 2026 04:287,03168,487,80557,238,0001,125,0002,113,536
9May 14, 2026 04:287,12467,139,60458,099,0001,036,0002,113,536