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 listNov 17, 2025 09:56AndreyAndreyScore: 101,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 09:56100,889863,814,740773,429,00063,952,0002,359,296
2Nov 17, 2025 09:56101,265864,737,815774,538,00065,960,0002,338,816
3Nov 17, 2025 09:56101,457869,971,484776,087,00066,007,0002,342,912
4Nov 17, 2025 09:56101,823876,170,130781,119,00064,009,0002,342,912
5Nov 17, 2025 09:56101,932874,095,850779,036,00067,003,0002,338,816
6Nov 17, 2025 09:56102,041875,464,349776,946,00069,995,0002,351,104
7Nov 17, 2025 09:56102,118872,528,201782,609,00064,967,0002,359,296
8Nov 17, 2025 09:56102,344878,950,796783,501,00065,958,0002,531,328
9Nov 17, 2025 09:56102,773881,241,990787,941,00065,077,0002,359,296