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 25, 2026 12:33Victor MerckléVictor MerckléScore: 4,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 12:344,28243,023,54034,453,0001,089,0002,113,536
2Jun 25, 2026 12:344,28243,165,58134,453,0001,088,0002,113,536
3Jun 25, 2026 12:344,28443,109,59334,448,0001,113,0002,113,536
4Jun 25, 2026 12:344,29443,231,64434,540,0001,101,0002,113,536
5Jun 25, 2026 12:344,29543,250,09034,586,0001,065,0002,113,536
6Jun 25, 2026 12:344,30943,396,12034,664,0001,102,0002,113,536
7Jun 25, 2026 12:344,31243,382,41334,702,0001,092,0002,113,536
8Jun 25, 2026 12:344,34343,624,94434,947,0001,102,0002,113,536
9Jun 25, 2026 12:344,60345,732,66237,182,0001,024,0002,113,536