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 listMar 29, 2026 13:16BrillentypBrillentypScore: 52,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 13:1652,805469,031,962438,279,00002,355,200
2Mar 29, 2026 13:1652,810462,521,754438,319,00002,289,664
3Mar 29, 2026 13:1652,811461,546,185437,331,0001,000,0002,363,392
4Mar 29, 2026 13:1652,815464,275,978438,362,00002,367,488
5Mar 29, 2026 13:1652,815462,320,429437,363,0001,000,0002,289,664
6Mar 29, 2026 13:1652,826463,619,555436,461,0001,997,0002,355,200
7Mar 29, 2026 13:1652,848465,774,332438,638,00002,289,664
8Mar 29, 2026 13:1652,849464,598,987437,645,000999,0002,289,664
9Mar 29, 2026 13:1652,866462,830,443437,788,000999,0002,478,080