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 2, 2026 22:18javivallejojavivallejoScore: 44,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 22:1844,341391,505,116367,029,0001,000,0002,289,664
2Feb 2, 2026 22:1844,354391,087,120367,142,0001,000,0002,289,664
3Feb 2, 2026 22:1844,362398,147,130366,200,0002,001,0002,289,664
4Feb 2, 2026 22:1844,375393,068,182367,311,0001,000,0002,519,040
5Feb 2, 2026 22:1844,382396,853,271368,368,00002,289,664
6Feb 2, 2026 22:1844,383397,722,590367,374,0001,001,0002,289,664
7Feb 2, 2026 22:1844,773398,420,502369,616,0001,997,0002,289,664
8Feb 2, 2026 22:1844,774403,165,436369,625,0001,997,0002,277,376
9Feb 2, 2026 22:1844,803400,944,645369,870,0001,999,0002,289,664