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 listOct 15, 2026 15:14timothygktimothygkScore: 34,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 15:1633,634289,735,498278,088,0001,078,0002,117,632stderr
2Oct 15, 2026 15:1633,638291,219,004278,131,0001,066,0002,117,632stderr
3Oct 15, 2026 15:1633,667290,742,485278,369,0001,075,0002,117,632stderr
4Oct 15, 2026 15:1634,498297,622,272285,328,0001,010,0002,117,632stderr
5Oct 15, 2026 15:1634,513297,065,615285,462,0001,002,0002,117,632stderr
6Oct 15, 2026 15:1634,517297,788,148285,392,0001,105,0002,117,632stderr
7Oct 15, 2026 15:1634,520297,504,437285,421,0001,100,0002,117,632stderr
8Oct 15, 2026 15:1634,521297,681,989285,425,0001,101,0002,117,632stderr
9Oct 15, 2026 15:1634,535297,994,799285,622,0001,024,0002,117,632stderr