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 listOct 5, 2026 02:05FrederickFrederickScore: 8,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:058,44880,557,27168,088,0002,038,0002,117,632
2Oct 5, 2026 02:058,67382,449,31569,964,0002,029,0002,117,632
3Oct 5, 2026 02:058,68082,496,87170,011,0002,034,0002,117,632
4Oct 5, 2026 02:058,69783,309,06270,160,0002,030,0002,117,632
5Oct 5, 2026 02:058,72782,937,04170,415,0002,025,0002,117,632
6Oct 5, 2026 02:058,75583,164,10270,621,0002,051,0002,117,632
7Oct 5, 2026 02:058,82983,913,14171,222,0002,065,0002,117,632
8Oct 5, 2026 02:058,92984,524,18072,092,0002,020,0002,117,632
9Oct 5, 2026 02:058,97384,962,24472,425,0002,055,0002,117,632