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 24, 2026 20:08Victor MerckléVictor MerckléScore: 8,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:097,98173,913,02565,154,0001,093,0002,117,632stderr
2Jun 24, 2026 20:097,99674,047,18665,272,0001,101,0002,117,632stderr
3Jun 24, 2026 20:098,00574,092,94665,308,0001,136,0002,117,632stderr
4Jun 24, 2026 20:098,04774,399,06865,690,0001,108,0002,117,632stderr
5Jun 24, 2026 20:098,22776,248,28167,178,0001,108,0002,117,632stderr
6Jun 24, 2026 20:098,23076,184,17667,197,0001,119,0002,117,632stderr
7Jun 24, 2026 20:098,23376,007,98667,228,0001,114,0002,117,632stderr
8Jun 24, 2026 20:098,24976,182,29767,334,0001,135,0002,117,632stderr
9Jun 24, 2026 20:098,33276,866,38068,013,0001,143,0002,117,632stderr