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 10, 2026 09:40wnwnScore: 3,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:413,30035,454,92126,377,0001,016,0002,113,536
2Jul 10, 2026 09:413,30335,443,01926,411,0001,010,0002,113,536
3Jul 10, 2026 09:413,30635,300,54826,437,0001,007,0002,113,536
4Jul 10, 2026 09:413,31035,655,26726,474,0001,003,0002,113,536
5Jul 10, 2026 09:413,33435,728,73926,671,0001,003,0002,113,536
6Jul 10, 2026 09:413,48436,948,90927,894,0001,026,0002,113,536
7Jul 10, 2026 09:413,48538,510,47727,874,0001,059,0002,113,536
8Jul 10, 2026 09:413,50637,541,84228,088,0001,016,0002,113,536
9Jul 10, 2026 09:413,52337,867,64128,233,0001,012,0002,113,536