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 listJan 2, 2026 22:24Josu San MartinJosu San MartinScore: 5,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 22:245,43267,477,82043,079,0002,003,0002,363,392
2Jan 2, 2026 22:245,51772,201,48744,800,000995,0002,367,488
3Jan 2, 2026 22:245,74377,828,07647,663,00002,293,760
4Jan 2, 2026 22:245,76572,308,71347,847,00002,375,680
5Jan 2, 2026 22:245,90078,174,54547,970,000999,0002,371,584
6Jan 2, 2026 22:245,90776,567,10947,027,0002,001,0002,281,472