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 11, 2026 19:10olliecrowolliecrowScore: 6,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:105,88774,713,54545,873,0002,991,0002,359,296
2Feb 11, 2026 19:105,90874,507,70347,038,0002,001,0002,260,992
3Feb 11, 2026 19:105,94674,757,31347,340,0002,014,0002,379,776
4Feb 11, 2026 19:106,29279,741,50748,205,0004,017,0002,396,160
5Feb 11, 2026 19:106,29879,653,26949,255,0003,015,0002,490,368
6Feb 11, 2026 19:106,36277,412,44548,823,0003,985,0002,510,848