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 14, 2026 15:24highload-churnerhighload-churnerScore: 3,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 15:243,18535,446,47526,443,000020,480
2Oct 14, 2026 15:243,18535,412,51626,438,000020,480
3Oct 14, 2026 15:243,18735,985,14926,455,000020,480
4Oct 14, 2026 15:243,19336,041,61826,510,000020,480
5Oct 14, 2026 15:243,19435,520,98526,512,000020,480
6Oct 14, 2026 15:243,19535,519,56426,526,000020,480
7Oct 14, 2026 15:243,19635,497,77426,529,000020,480
8Oct 14, 2026 15:243,19835,465,35726,545,000020,480
9Oct 14, 2026 15:243,19836,045,62826,549,000020,480