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 listOct 2, 2026 07:26Karthik ReddyKarthik ReddyScore: 3,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 07:283,2656,036,413,74627,101,000020,480
2Oct 2, 2026 07:283,2656,036,324,80327,107,000020,480
3Oct 2, 2026 07:283,2676,036,251,19327,117,000020,480
4Oct 2, 2026 07:283,2776,036,325,09727,202,000020,480
5Oct 2, 2026 07:283,2776,036,484,05927,206,000020,480
6Oct 2, 2026 07:283,2826,036,510,88327,241,000020,480
7Oct 2, 2026 07:283,2846,036,395,52327,265,000020,480
8Oct 2, 2026 07:283,2946,036,577,75826,342,0001,001,00020,480
9Oct 2, 2026 07:283,3066,036,623,36026,433,0001,010,00020,480