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:36CheckHarryCheckHarryScore: 4,244Success
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:374,23444,985,14034,088,0001,061,0002,113,536
2Sep 6, 2026 02:374,24145,043,01934,141,0001,061,0002,113,536
3Sep 6, 2026 02:374,24145,099,83734,147,0001,058,0002,113,536
4Sep 6, 2026 02:374,24445,145,39134,184,0001,048,0002,113,536
5Sep 6, 2026 02:374,24445,181,03634,175,0001,055,0002,113,536
6Sep 6, 2026 02:374,24445,166,57534,156,0001,070,0002,129,920
7Sep 6, 2026 02:374,25645,205,38834,268,0001,057,0002,113,536
8Sep 6, 2026 02:374,40046,460,86235,458,0001,064,0002,113,536
9Sep 6, 2026 02:374,43946,822,45235,786,0001,064,0002,113,536