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 03:37Teow Hua JunTeow Hua JunScore: 11,108Success
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 03:3710,958100,340,86280,989,0009,963,0002,113,536
2Jul 6, 2026 03:3711,064101,237,18381,765,00010,069,0002,113,536
3Jul 6, 2026 03:3711,065101,349,33481,233,00010,610,0002,113,536
4Jul 6, 2026 03:3711,067101,260,13681,524,00010,338,0002,113,536
5Jul 6, 2026 03:3711,108101,572,39681,597,00010,602,0002,113,536
6Jul 6, 2026 03:3711,134101,766,75081,390,00011,030,0002,113,536
7Jul 6, 2026 03:3711,144101,870,97682,132,00010,364,0002,113,536
8Jul 6, 2026 03:3711,150101,962,96982,138,00010,413,0002,113,536
9Jul 6, 2026 03:3711,209102,446,69781,609,00011,427,0002,113,536