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 listJun 26, 2026 10:52Victor MerckléVictor MerckléScore: 4,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 10:534,43544,303,87435,720,0001,096,0002,117,632stderr
2Jun 26, 2026 10:534,44244,471,10035,742,0001,131,0002,117,632stderr
3Jun 26, 2026 10:534,44844,464,90935,811,0001,115,0002,117,632stderr
4Jun 26, 2026 10:534,46844,559,74135,989,0001,097,0002,117,632stderr
5Jun 26, 2026 10:534,46844,599,38535,978,0001,113,0002,117,632stderr
6Jun 26, 2026 10:534,48244,699,76436,067,0001,139,0002,117,632stderr
7Jun 26, 2026 10:534,58145,736,26036,926,0001,101,0002,117,632stderr
8Jun 26, 2026 10:534,59345,611,48337,114,0001,016,0002,117,632stderr
9Jun 26, 2026 10:534,60845,778,48237,216,0001,034,0002,117,632stderr