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 3, 2026 14:30CheckHarryCheckHarryScore: 4,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:304,42846,538,66735,742,0001,016,0002,113,536
2Sep 3, 2026 14:304,43846,745,91635,827,0001,015,0002,113,536
3Sep 3, 2026 14:304,44346,694,04835,848,0001,032,0002,113,536
4Sep 3, 2026 14:304,45146,872,15835,904,0001,040,0002,113,536
5Sep 3, 2026 14:304,45646,864,77235,972,0001,017,0002,113,536
6Sep 3, 2026 14:304,46947,020,78136,056,0001,043,0002,113,536
7Sep 3, 2026 14:304,50047,199,07236,325,0001,025,0002,113,536
8Sep 3, 2026 14:304,50047,055,72236,334,0001,017,0002,113,536
9Sep 3, 2026 14:304,59647,994,35437,132,0001,021,0002,113,536