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 listJul 9, 2026 20:22Victor MerckléVictor MerckléScore: 37,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 20:2437,883322,476,553313,176,0001,257,0002,117,632stderr
2Jul 9, 2026 20:2437,939322,823,966313,707,0001,193,0002,117,632stderr
3Jul 9, 2026 20:2437,950323,017,685313,802,0001,187,0002,117,632stderr
4Jul 9, 2026 20:2437,956323,205,154314,030,0001,007,0002,117,632stderr
5Jul 9, 2026 20:2437,956323,091,823313,995,0001,048,0002,117,632stderr
6Jul 9, 2026 20:2437,996323,439,478314,334,0001,037,0002,117,632stderr
7Jul 9, 2026 20:2438,096324,384,708315,037,0001,165,0002,117,632stderr
8Jul 9, 2026 20:2438,746329,690,297320,590,0001,002,0002,117,632stderr
9Jul 9, 2026 20:2439,025332,179,808322,724,0001,188,0002,117,632stderr