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 19, 2026 22:08lipapipalipapipaScore: 12,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 22:0812,016122,526,94796,739,0002,991,0002,510,848
2Feb 19, 2026 22:0812,019126,235,81396,762,0002,992,0002,449,408
3Feb 19, 2026 22:0812,378137,323,538102,739,00002,449,408
4Feb 19, 2026 22:0812,979129,445,208104,735,0002,992,0002,437,120
5Feb 19, 2026 22:0812,994134,251,148105,852,0001,997,0002,265,088
6Feb 19, 2026 22:0813,002129,812,287105,919,0001,998,0002,433,024