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 listFeb 27, 2026 13:30Genos0Genos0Score: 71,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3071,270618,168,192533,585,00057,955,0002,375,680
2Feb 27, 2026 13:3071,282623,068,234534,678,00056,965,0002,289,664
3Feb 27, 2026 13:3071,283617,356,171533,683,00057,965,0002,510,848
4Feb 27, 2026 13:3071,290616,376,821532,733,00058,970,0002,289,664
5Feb 27, 2026 13:3071,324617,158,258535,990,00055,999,0002,281,472
6Feb 27, 2026 13:3071,330614,754,133538,038,00054,003,0002,375,680
7Feb 27, 2026 13:3071,340626,244,962535,112,00057,012,0002,289,664
8Feb 27, 2026 13:3071,350618,228,417533,184,00059,020,0002,281,472
9Feb 27, 2026 13:3071,540618,710,538535,802,00057,978,0002,289,664