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 23, 2026 20:50Elijah KinElijah KinScore: 49,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 20:4948,755430,764,836402,666,0001,998,0002,383,872
2Mar 23, 2026 21:0948,776430,639,249402,839,0001,999,0002,523,136
3Mar 23, 2026 21:0948,780434,634,965403,875,000999,0002,523,136
4Mar 23, 2026 20:4948,785434,345,223402,914,0001,999,0002,523,136
5Mar 23, 2026 21:0948,797433,601,241404,018,0001,000,0002,523,136
6Mar 23, 2026 20:4948,808429,348,887404,109,0001,000,0002,519,040
7Mar 23, 2026 20:4849,997443,134,746412,974,0001,999,0002,265,088
8Mar 23, 2026 20:4850,036438,983,810415,300,00002,383,872
9Mar 23, 2026 20:4850,054442,035,934414,451,000998,0002,260,992
10Mar 23, 2026 20:5050,320441,359,820415,660,0001,998,0002,383,872
11Mar 23, 2026 20:5050,327449,426,812415,719,0001,998,0002,523,136
12Mar 23, 2026 20:5050,371444,892,405417,079,0001,000,0002,383,872