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 27, 2026 17:37illliliiill1116illliliiill1116Score: 6,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 17:406,51664,435,50153,071,0001,014,0002,113,536
2Sep 27, 2026 17:406,52264,411,44053,121,0001,013,0002,113,536
3Sep 27, 2026 17:406,52264,444,04653,125,0001,014,0002,113,536
4Sep 27, 2026 17:406,54364,570,05253,299,0001,013,0002,113,536
5Sep 27, 2026 17:406,54464,469,74353,310,0001,012,0002,113,536
6Sep 27, 2026 17:406,55364,647,51753,383,0001,012,0002,113,536
7Sep 27, 2026 17:406,55564,691,44353,395,0001,016,0002,113,536
8Sep 27, 2026 17:406,55965,036,52153,432,0001,015,0002,113,536
9Sep 27, 2026 17:406,56064,742,84153,438,0001,014,0002,113,536