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 20, 2026 05:57M-RochatM-RochatScore: 11,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:5711,799107,326,31095,606,0002,327,0002,113,536
2May 20, 2026 05:5711,801109,103,68595,609,0002,345,0002,113,536
3May 20, 2026 05:5711,810110,232,60995,667,0002,362,0002,113,536
4May 20, 2026 05:5711,811108,625,53595,709,0002,324,0002,113,536
5May 20, 2026 05:5711,811108,965,10095,694,0002,343,0002,113,536
6May 20, 2026 05:5711,814110,339,50196,022,0002,035,0002,113,536
7May 20, 2026 05:5711,819108,721,82696,088,0002,010,0002,113,536
8May 20, 2026 05:5711,834107,787,67496,164,0002,062,0002,113,536
9May 20, 2026 05:5711,851111,119,72396,315,0002,050,0002,113,536