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 22, 2026 18:18timothygktimothygkScore: 15,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 18:1915,612141,783,50999,737,00029,850,0002,117,632stderr
2Oct 22, 2026 18:1915,707141,348,02499,829,00030,547,0002,117,632stderr
3Oct 22, 2026 18:1915,742141,762,518100,333,00030,332,0002,117,632stderr
4Oct 22, 2026 18:1915,779141,963,130100,535,00030,431,0002,117,632stderr
5Oct 22, 2026 18:1915,789142,027,528100,349,00030,700,0002,117,632stderr
6Oct 22, 2026 18:1915,842142,476,022100,898,00030,597,0002,117,632stderr
7Oct 22, 2026 18:1915,885143,282,437101,157,00030,695,0002,117,632stderr
8Oct 22, 2026 18:1916,103144,666,925101,923,00031,732,0002,117,632stderr
9Oct 22, 2026 18:1916,877151,061,654105,485,00034,598,0002,117,632stderr