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 listApr 22, 2026 06:05wnwnScore: 6,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 06:056,11865,689,81948,796,0001,991,0002,473,984
2Apr 22, 2026 06:056,12163,894,43248,817,0001,992,0002,486,272
3Apr 22, 2026 06:056,12264,008,97048,826,0001,992,0002,490,368
4Apr 22, 2026 06:056,12868,977,14348,876,0001,994,0002,494,464
5Apr 22, 2026 06:056,22666,647,38149,691,0001,987,0002,486,272
6Apr 22, 2026 06:056,24971,213,44349,879,0001,995,0002,478,080
7Apr 22, 2026 06:056,29469,992,61551,239,0001,004,0002,486,272
8Apr 22, 2026 06:056,30769,814,05451,350,0001,006,0002,486,272
9Apr 22, 2026 06:056,32572,188,57051,491,0001,009,0002,490,368