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 14, 2026 15:36Kevin HeaveyKevin HeaveyScore: 3,551Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 15:373,52538,015,27028,082,0001,179,0002,113,536
2Sep 14, 2026 15:373,53138,032,74528,115,0001,196,0002,113,536
3Sep 14, 2026 15:373,54438,210,50728,227,0001,196,0002,113,536
4Sep 14, 2026 15:373,54838,239,36628,411,0001,043,0002,113,536
5Sep 14, 2026 15:373,55138,241,58628,310,0001,171,0002,113,536
6Sep 14, 2026 15:373,55938,293,81528,352,0001,193,0002,113,536
7Sep 14, 2026 15:373,56238,377,92928,532,0001,035,0002,113,536
8Sep 14, 2026 15:373,76340,221,67430,072,0001,168,0002,113,536
9Sep 14, 2026 15:373,82540,752,30230,542,0001,211,0002,113,536