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 listNov 3, 2026 09:11Andrew EpsteinAndrew EpsteinScore: 98,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 09:1198,642828,036,637816,698,0002,036,0002,121,728stderr
2Nov 3, 2026 09:1198,674828,516,019816,959,0002,043,0002,121,728stderr
3Nov 3, 2026 09:1198,679828,365,051817,009,0002,031,0002,121,728stderr
4Nov 3, 2026 09:1198,691829,016,520817,089,0002,054,0002,121,728stderr
5Nov 3, 2026 09:1198,722829,248,529817,372,0002,025,0002,121,728stderr
6Nov 3, 2026 09:1198,842829,644,987818,332,0002,063,0002,121,728stderr
7Nov 3, 2026 09:1198,892830,524,678818,770,0002,037,0002,121,728stderr
8Nov 3, 2026 09:1198,948830,691,399819,237,0002,035,0002,121,728stderr
9Nov 3, 2026 09:1199,158832,727,088820,964,0002,053,0002,121,728stderr