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 listSep 6, 2026 02:27CheckHarryCheckHarryScore: 4,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 02:284,38046,201,49935,130,0001,226,0002,113,536
2Sep 6, 2026 02:284,38246,155,87435,118,0001,254,0002,113,536
3Sep 6, 2026 02:284,38546,266,29535,185,0001,217,0002,113,536
4Sep 6, 2026 02:284,39646,321,11035,262,0001,231,0002,113,536
5Sep 6, 2026 02:284,40346,402,66335,334,0001,213,0002,113,536
6Sep 6, 2026 02:284,41546,647,10135,410,0001,237,0002,113,536
7Sep 6, 2026 02:284,41946,493,41835,450,0001,235,0002,113,536
8Sep 6, 2026 02:284,43946,732,68735,608,0001,240,0002,113,536
9Sep 6, 2026 02:284,48347,234,98235,965,0001,247,0002,113,536