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 6, 2026 04:51Teow Hua JunTeow Hua JunScore: 11,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 04:5211,434104,575,18784,732,00010,177,0002,113,536
2Jul 6, 2026 04:5211,512105,426,73284,954,00010,596,0002,113,536
3Jul 6, 2026 04:5211,517106,702,45685,313,00010,281,0002,113,536
4Jul 6, 2026 04:5211,542105,890,69585,608,00010,195,0002,113,536
5Jul 6, 2026 04:5211,576105,777,74985,265,00010,822,0002,113,536
6Jul 6, 2026 04:5211,614106,461,07684,897,00011,505,0002,113,536
7Jul 6, 2026 04:5211,635106,630,65685,324,00011,247,0002,113,536
8Jul 6, 2026 04:5211,689107,269,46586,631,00010,395,0002,113,536
9Jul 6, 2026 04:5211,717107,336,41786,481,00010,778,0002,113,536