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 listApr 26, 2026 06:25Charles CabergsCharles CabergsScore: 17,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 06:2517,214161,005,887140,886,0001,998,0002,367,488
2Apr 26, 2026 06:2517,216162,510,369141,895,000999,0002,367,488
3Apr 26, 2026 06:2517,232167,549,515141,028,0002,000,0002,375,680
4Apr 26, 2026 06:2517,237157,020,554141,072,0002,001,0002,297,856
5Apr 26, 2026 06:2517,253163,214,905142,199,0001,001,0002,306,048
6Apr 26, 2026 06:2517,257164,207,550141,238,0002,003,0002,363,392
7Apr 26, 2026 06:2517,905164,758,368147,613,0001,004,0002,367,488
8Apr 26, 2026 06:2518,057168,325,249147,881,0001,998,0002,355,200
9Apr 26, 2026 06:2518,067169,268,047147,963,0001,999,0002,293,760