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 15:59Kasper KivimäkiKasper KivimäkiScore: 58,570Success
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 15:5957,345485,866,809474,763,0001,207,0002,113,536
2Jul 23, 2026 15:5957,620488,212,838477,021,0001,227,0002,113,536
3Jul 23, 2026 15:5958,527495,750,442484,773,0001,003,0002,113,536
4Jul 23, 2026 15:5958,544495,808,652484,674,0001,244,0002,113,536
5Jul 23, 2026 15:5958,570496,038,971484,970,0001,161,0002,113,536
6Jul 23, 2026 15:5958,577496,060,384484,998,0001,192,0002,113,536
7Jul 23, 2026 15:5958,598496,297,934485,201,0001,170,0002,113,536
8Jul 23, 2026 15:5958,608496,421,753485,449,0001,002,0002,113,536
9Jul 23, 2026 15:5958,696497,209,400486,179,0001,002,0002,113,536