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 listMay 11, 2026 21:47Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:48093,843,32283,884,0001,176,0002,113,536expected "53682748788589923 ", got "53682748788587363 "
2May 11, 2026 21:4810,23593,697,76183,861,0001,095,0002,113,536
3May 11, 2026 21:4810,24094,123,64283,825,0001,170,0002,113,536
4May 11, 2026 21:4810,24393,876,08583,848,0001,176,0002,113,536
5May 11, 2026 21:4810,24493,847,27783,855,0001,172,0002,113,536
6May 11, 2026 21:4810,24597,024,49583,857,0001,179,0002,113,536
7May 11, 2026 21:4810,24793,665,89184,050,0001,003,0002,113,536
8May 11, 2026 21:4810,25093,892,61483,912,0001,164,0002,113,536
9May 11, 2026 21:4810,25096,629,33183,905,0001,171,0002,113,536