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 30, 2026 10:37Victor MerckléVictor MerckléScore: 4,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:404,76247,417,23038,418,0001,113,0002,117,632stderr
2Jun 30, 2026 10:404,77247,324,90238,495,0001,116,0002,117,632stderr
3Jun 30, 2026 10:404,81547,838,25538,870,0001,098,0002,117,632stderr
4Jun 30, 2026 10:404,81647,665,33338,908,0001,067,0002,117,632stderr
5Jun 30, 2026 10:404,82547,836,49938,934,0001,120,0002,117,632stderr
6Jun 30, 2026 10:404,82847,812,02339,021,0001,052,0002,117,632stderr
7Jun 30, 2026 10:404,83747,872,78439,129,0001,023,0002,117,632stderr
8Jun 30, 2026 10:404,84548,068,38739,193,0001,022,0002,117,632stderr
9Jun 30, 2026 10:404,85548,024,01839,164,0001,135,0002,117,632stderr