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 23, 2026 16:06Kasper KivimäkiKasper KivimäkiScore: 56,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:0756,301477,119,909466,168,0001,138,0002,113,536
2Jul 23, 2026 16:0756,304477,640,279466,195,0001,131,0002,113,536
3Jul 23, 2026 16:0756,317477,185,951466,344,0001,092,0002,113,536
4Jul 23, 2026 16:0756,340477,389,714466,455,0001,175,0002,113,536
5Jul 23, 2026 16:0756,343477,496,310466,413,0001,236,0002,113,536
6Jul 23, 2026 16:0756,346478,154,088466,514,0001,166,0002,113,536
7Jul 23, 2026 16:0756,347478,013,445466,561,0001,123,0002,113,536
8Jul 23, 2026 16:0756,359477,603,072466,684,0001,098,0002,113,536
9Jul 23, 2026 16:0756,377478,275,725466,810,0001,125,0002,113,536