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 14, 2026 20:19Kevin HeaveyKevin HeaveyScore: 3,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:203,74040,732,14530,024,0001,025,0002,117,632
2Jul 14, 2026 20:203,74040,673,99930,012,0001,031,0002,117,632
3Jul 14, 2026 20:203,75340,816,11630,132,0001,021,0002,117,632
4Jul 14, 2026 20:203,76240,825,00030,202,0001,027,0002,117,632
5Jul 14, 2026 20:203,76540,818,15930,228,0001,022,0002,117,632
6Jul 14, 2026 20:205,46654,965,36644,353,0001,021,0002,117,632
7Jul 14, 2026 20:205,53255,501,62444,906,0001,016,0002,117,632
8Jul 14, 2026 20:205,56955,784,88145,209,0001,019,0002,117,632
9Jul 14, 2026 20:205,63556,348,56145,761,0001,015,0002,117,632