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 19:54Victor MerckléVictor MerckléScore: 4,524Success
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 19:554,51144,930,46436,307,0001,135,0002,117,632stderr
2Jun 24, 2026 19:554,51645,201,99536,392,0001,098,0002,117,632stderr
3Jun 24, 2026 19:554,52146,356,14236,443,0001,083,0002,117,632stderr
4Jun 24, 2026 19:554,52145,565,76336,434,0001,098,0002,117,632stderr
5Jun 24, 2026 19:554,52445,609,04336,447,0001,103,0002,117,632stderr
6Jun 24, 2026 19:554,53245,651,86636,496,0001,125,0002,117,632stderr
7Jun 24, 2026 19:554,53445,277,56536,551,0001,085,0002,117,632stderr
8Jun 24, 2026 19:554,54245,273,86036,587,0001,119,0002,117,632stderr
9Jun 24, 2026 19:554,70246,651,50537,991,0001,037,0002,117,632stderr