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 listJul 3, 2026 17:56Josu San MartinJosu San MartinScore: 11,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:5711,536105,188,25792,515,0003,239,0002,113,536
2Jul 3, 2026 17:5711,576105,428,26192,875,0003,213,0002,113,536
3Jul 3, 2026 17:5711,623105,802,80993,401,0003,076,0002,113,536
4Jul 3, 2026 17:5711,631105,941,18393,180,0003,362,0002,113,536
5Jul 3, 2026 17:5711,633105,873,59093,502,0003,056,0002,113,536
6Jul 3, 2026 17:5711,748106,870,61794,409,0003,107,0002,113,536
7Jul 3, 2026 17:5711,771107,115,10694,448,0003,253,0002,113,536
8Jul 3, 2026 17:5711,799107,389,19194,707,0003,227,0002,113,536
9Jul 3, 2026 17:5711,805107,409,00994,918,0003,068,0002,113,536