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 13, 2026 17:18Aleksei ShahoikaAleksei ShahoikaScore: 14,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:1914,273130,058,71196,559,00021,912,0002,113,536
2May 13, 2026 17:1914,297128,368,54796,708,00021,960,0002,113,536
3May 13, 2026 17:1914,352129,867,76996,811,00022,315,0002,113,536
4May 13, 2026 17:1914,429129,488,76696,952,00022,810,0002,113,536
5May 13, 2026 17:1914,463131,038,41796,734,00023,310,0002,113,536
6May 13, 2026 17:1914,467130,786,55196,580,00023,502,0002,113,536
7May 13, 2026 17:1914,475128,941,39796,827,00023,321,0002,113,536
8May 13, 2026 17:1914,627130,183,83696,565,00024,843,0002,113,536
9May 13, 2026 17:1914,686130,639,59798,125,00023,770,0002,113,536