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 5, 2026 12:47wnwnScore: 3,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 12:493,29235,671,74226,290,0001,035,0002,113,536
2Sep 5, 2026 12:493,29935,876,82526,360,0001,028,0002,113,536
3Sep 5, 2026 12:493,29935,839,43426,348,0001,036,0002,113,536
4Sep 5, 2026 12:493,32936,091,57526,589,0001,043,0002,113,536
5Sep 5, 2026 12:493,44637,766,83027,595,0001,007,0002,113,536
6Sep 5, 2026 12:493,47237,270,93027,816,0001,003,0002,113,536
7Sep 5, 2026 12:493,48438,069,54727,897,0001,024,0002,113,536
8Sep 5, 2026 12:493,50238,264,02628,067,0001,003,0002,113,536
9Sep 5, 2026 12:493,51738,364,40828,193,0001,003,0002,113,536