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 13, 2026 03:09highload-churnerhighload-churnerScore: 3,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 03:093,28736,133,56227,286,000020,480
2Oct 13, 2026 03:093,30136,251,55627,403,000020,480
3Oct 13, 2026 03:093,42937,948,63428,461,000020,480
4Oct 13, 2026 03:093,45737,554,94428,695,000020,480
5Oct 13, 2026 03:093,46437,800,76228,759,000020,480
6Oct 13, 2026 03:093,48138,379,54228,897,000020,480
7Oct 13, 2026 03:093,51237,997,18529,155,000020,480
8Oct 13, 2026 03:093,51938,766,07729,208,000020,480
9Oct 13, 2026 03:093,52238,664,41829,239,000020,480