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:04Kevin HeaveyKevin HeaveyScore: 3,894Success
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:053,63040,364,75429,107,0001,027,0002,117,632
2Sep 12, 2026 16:053,64740,441,22529,042,0001,233,0002,117,632
3Sep 12, 2026 16:053,65340,567,47929,281,0001,040,0002,117,632
4Sep 12, 2026 16:053,72941,189,65129,743,0001,212,0002,117,632
5Sep 12, 2026 16:053,89442,554,08631,097,0001,224,0002,117,632
6Sep 12, 2026 16:053,90342,663,85231,174,0001,226,0002,117,632
7Sep 12, 2026 16:053,91442,695,94531,474,0001,018,0002,117,632
8Sep 12, 2026 16:053,94842,939,04631,569,0001,205,0002,117,632
9Sep 12, 2026 16:053,96243,179,71931,675,0001,215,0002,117,632