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 13, 2026 10:28janwwwjanwwwScore: 4,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 10:284,28344,570,05534,422,0001,130,0002,117,632
2Oct 13, 2026 10:284,32744,912,41634,797,0001,118,0002,117,632
3Oct 13, 2026 10:284,34344,992,58734,914,0001,134,0002,117,632
4Oct 13, 2026 10:284,40845,639,80435,382,0001,210,0002,117,632
5Oct 13, 2026 10:284,42345,692,42735,496,0001,220,0002,117,632
6Oct 13, 2026 10:284,45045,902,87835,730,0001,206,0002,117,632
7Oct 13, 2026 10:284,45245,994,08835,804,0001,151,0002,117,632
8Oct 13, 2026 10:284,52847,190,51436,433,0001,151,0002,117,632
9Oct 13, 2026 10:284,58147,109,27236,899,0001,130,0002,117,632