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 listJul 5, 2026 20:43Kevin HeaveyKevin HeaveyScore: 5,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:445,10451,887,29941,191,0001,178,0002,117,632
2Jul 5, 2026 20:445,18952,575,35641,811,0001,258,0002,117,632
3Jul 5, 2026 20:445,19652,692,51241,897,0001,236,0002,117,632
4Jul 5, 2026 20:445,19952,848,88141,890,0001,262,0002,117,632
5Jul 5, 2026 20:445,21158,765,04942,046,0001,206,0002,117,632
6Jul 5, 2026 20:445,22854,522,62042,164,0001,236,0002,117,632
7Jul 5, 2026 20:445,23053,028,89042,164,0001,250,0002,117,632
8Jul 5, 2026 20:445,33053,788,44943,052,0001,188,0002,117,632
9Jul 5, 2026 20:445,47054,949,62944,163,0001,243,0002,117,632