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 18, 2026 21:09Aleksei ShahoikaAleksei ShahoikaScore: 12,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 21:0912,480114,943,44082,307,00021,277,0002,113,536
2May 18, 2026 21:0912,510115,489,94582,607,00021,234,0002,113,536
3May 18, 2026 21:0912,517113,302,61782,564,00021,334,0002,113,536
4May 18, 2026 21:0912,524114,429,31482,550,00021,407,0002,113,536
5May 18, 2026 21:0912,526115,181,83782,590,00021,384,0002,113,536
6May 18, 2026 21:0912,531116,109,20082,410,00021,601,0002,113,536
7May 18, 2026 21:0912,540115,981,04982,339,00021,743,0002,113,536
8May 18, 2026 21:0912,557115,432,06882,617,00021,610,0002,113,536
9May 18, 2026 21:0912,909117,311,49082,308,00024,844,0002,113,536