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 30, 2026 20:58olliecrowolliecrowScore: 71,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 20:5871,242623,756,319590,308,0001,000,0002,281,472
2Jan 30, 2026 21:0771,253622,573,788589,398,0002,001,0002,281,472
3Jan 30, 2026 21:0771,272616,358,704590,558,000999,0002,281,472
4Jan 30, 2026 20:5871,285621,425,454589,666,0001,998,0002,359,296
5Jan 30, 2026 21:0771,289620,236,018590,702,000999,0002,281,472
6Jan 30, 2026 20:5871,296622,297,814588,757,0002,998,0002,281,472