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 25, 2026 03:25Karthik ReddyKarthik ReddyScore: 8,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 03:268,82083,597,18472,194,0001,015,0002,113,536
2Sep 25, 2026 03:268,92484,464,85573,060,0001,012,0002,113,536
3Sep 25, 2026 03:268,92584,514,54873,068,0001,012,0002,113,536
4Sep 25, 2026 03:268,94984,629,46573,266,0001,015,0002,113,536
5Sep 25, 2026 03:268,95084,685,10573,278,0001,014,0002,113,536
6Sep 25, 2026 03:268,99585,012,64173,647,0001,014,0002,113,536
7Sep 25, 2026 03:269,00185,138,09973,698,0001,012,0002,113,536
8Sep 25, 2026 03:269,04185,432,60273,018,0002,023,0002,113,536
9Sep 25, 2026 03:269,21686,980,62675,485,0001,012,0002,113,536