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 15, 2026 18:23boop34boop34Score: 9,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 18:249,34987,157,51276,594,0001,007,0002,113,536
2Jul 15, 2026 18:249,38787,633,08276,913,0001,007,0002,113,536
3Jul 15, 2026 18:249,41287,627,29777,119,0001,006,0002,113,536
4Jul 15, 2026 18:249,41887,741,32277,171,0001,006,0002,113,536
5Jul 15, 2026 18:249,46888,193,19877,575,0001,010,0002,113,536
6Jul 15, 2026 18:249,52988,623,73478,085,0001,006,0002,113,536
7Jul 15, 2026 18:249,58589,181,86378,543,0001,019,0002,113,536
8Jul 15, 2026 18:249,63689,619,00678,972,0001,007,0002,113,536
9Jul 15, 2026 18:249,73290,420,13679,770,0001,006,0002,113,536