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 24, 2026 05:23wnwnScore: 3,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:243,37436,775,54826,998,0001,009,0002,113,536
2Sep 24, 2026 05:243,38836,932,73327,118,0001,008,0002,113,536
3Sep 24, 2026 05:243,39537,016,44027,176,0001,005,0002,113,536
4Sep 24, 2026 05:243,40437,008,91027,228,0001,033,0002,113,536
5Sep 24, 2026 05:243,51638,025,31028,158,0001,033,0002,113,536
6Sep 24, 2026 05:243,55338,949,24828,454,0001,044,0002,113,536
7Sep 24, 2026 05:243,56038,321,37728,517,0001,036,0002,113,536
8Sep 24, 2026 05:243,57939,182,46628,704,0001,009,0002,113,536
9Sep 24, 2026 05:243,59339,215,78928,812,0001,010,0002,113,536