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 10, 2026 07:00Victor MerckléVictor MerckléScore: 4,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 07:034,67647,810,24937,630,0001,181,0002,174,976
2Jun 10, 2026 07:034,69147,957,16337,763,0001,179,0002,174,976
3Jun 10, 2026 07:034,89749,572,05739,464,0001,184,0002,129,920
4Jun 10, 2026 07:034,90149,674,03339,504,0001,176,0002,129,920
5Jun 10, 2026 07:034,90849,627,48139,572,0001,171,0002,129,920
6Jun 10, 2026 07:034,90949,759,03039,553,0001,199,0002,129,920
7Jun 10, 2026 07:034,93151,153,70739,727,0001,201,0002,129,920
8Jun 10, 2026 07:034,93849,828,19839,809,0001,184,0002,174,976
9Jun 10, 2026 07:034,97150,198,19440,056,0001,204,0002,129,920