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 20, 2026 01:34Serhii SakhnoSerhii SakhnoScore: 73,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 01:3473,053633,002,861605,340,0001,000,0002,281,472
2Feb 20, 2026 01:3473,055635,581,111606,355,00002,273,280
3Feb 20, 2026 01:3473,073630,528,713604,507,0001,998,0002,269,184
4Feb 20, 2026 01:3473,077635,220,519605,543,000999,0002,281,472
5Feb 20, 2026 01:3473,081635,241,649604,571,0001,998,0002,281,472
6Feb 20, 2026 01:3473,087628,843,884605,627,000999,0002,269,184
7Feb 20, 2026 01:3473,103633,706,630604,752,0001,999,0002,527,232
8Feb 20, 2026 01:3473,110627,658,548602,819,0003,998,0002,281,472
9Feb 20, 2026 01:3473,187629,714,831605,451,0001,998,0002,281,472