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 listSep 12, 2026 16:09Kevin HeaveyKevin HeaveyScore: 3,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:103,63940,450,05429,168,0001,040,0002,117,632
2Sep 12, 2026 16:103,69240,793,11029,440,0001,211,0002,117,632
3Sep 12, 2026 16:103,88742,526,82231,058,0001,212,0002,117,632
4Sep 12, 2026 16:103,88842,514,86531,042,0001,231,0002,117,632
5Sep 12, 2026 16:103,91042,706,98531,416,0001,039,0002,117,632
6Sep 12, 2026 16:103,92742,911,78231,383,0001,212,0002,117,632
7Sep 12, 2026 16:103,95743,086,70531,811,0001,036,0002,117,632
8Sep 12, 2026 16:103,95943,097,11631,644,0001,220,0002,117,632
9Sep 12, 2026 16:103,96543,158,74931,893,0001,022,0002,117,632