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 02:31Victor MerckléVictor MerckléScore: 4,896Success
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 02:324,88348,844,34139,481,0001,050,0002,138,112
2Jun 10, 2026 02:324,88348,218,33139,491,0001,044,0002,138,112
3Jun 10, 2026 02:324,89448,288,80239,584,0001,038,0002,138,112
4Jun 10, 2026 02:324,89548,372,17539,580,0001,054,0002,138,112
5Jun 10, 2026 02:324,89648,325,99439,608,0001,031,0002,138,112
6Jun 10, 2026 02:324,90448,395,50639,681,0001,030,0002,138,112
7Jun 10, 2026 02:324,90548,403,32639,680,0001,038,0002,138,112
8Jun 10, 2026 02:324,91248,540,33839,713,0001,064,0002,138,112
9Jun 10, 2026 02:324,91450,760,38839,731,0001,058,0002,138,112