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 00:39avoidcatenjoyersavoidcatenjoyersScore: 122,412Success
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 00:40122,3441,026,617,444956,633,00058,824,0002,113,536
2May 20, 2026 00:40122,3711,028,505,118957,219,00058,468,0002,113,536
3May 20, 2026 00:40122,3831,028,083,995957,131,00058,656,0002,113,536
4May 20, 2026 00:40122,3871,026,809,191956,778,00059,041,0002,113,536
5May 20, 2026 00:40122,4121,027,516,095957,433,00058,587,0002,113,536
6May 20, 2026 00:40122,4241,027,268,642957,110,00059,016,0002,113,536
7May 20, 2026 00:40122,4401,026,221,469957,441,00058,819,0002,113,536
8May 20, 2026 00:40122,4611,027,047,006957,729,00058,704,0002,113,536
9May 20, 2026 00:40122,4761,027,740,725957,859,00058,692,0002,113,536