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 24, 2026 12:57Victor MerckléVictor MerckléScore: 5,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 12:585,29152,859,15842,844,0001,078,0002,113,536
2May 24, 2026 12:585,29551,996,77042,861,0001,091,0002,113,536
3May 24, 2026 12:585,30951,902,74442,982,0001,090,0002,113,536
4May 24, 2026 12:585,31151,811,50643,065,0001,018,0002,113,536
5May 24, 2026 12:585,31353,579,28743,018,0001,081,0002,113,536
6May 24, 2026 12:585,31453,910,20543,020,0001,091,0002,113,536
7May 24, 2026 12:585,32853,834,15343,203,0001,020,0002,113,536
8May 24, 2026 12:585,33152,986,46743,246,0001,003,0002,113,536
9May 24, 2026 12:585,35954,330,70043,369,0001,113,0002,113,536