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 listFeb 2, 2026 20:33javivallejojavivallejoScore: 64,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 20:3364,171559,218,672530,620,0001,998,0002,519,040
2Feb 2, 2026 20:3364,180561,344,402529,692,0002,998,0002,510,848
3Feb 2, 2026 20:3364,180558,955,954530,695,0001,998,0002,260,992
4Feb 2, 2026 20:3364,181562,864,577531,702,000999,0002,322,432
5Feb 2, 2026 20:3364,191560,434,423529,787,0002,998,0002,326,528
6Feb 2, 2026 20:3364,191565,754,554530,789,0001,999,0002,510,848
7Feb 2, 2026 20:3364,195561,861,472531,821,000999,0002,510,848
8Feb 2, 2026 20:3364,198560,753,121531,846,000999,0002,519,040
9Feb 2, 2026 20:3364,211565,319,826531,956,000999,0002,510,848