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 22, 2026 21:29SneedSneedScore: 51,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 21:2951,683456,642,372423,966,0004,999,0002,277,376
2Feb 22, 2026 21:2951,692456,808,426428,044,0001,000,0002,277,376
3Feb 22, 2026 21:2951,696462,085,249428,073,0001,000,0002,273,280
4Feb 22, 2026 21:2951,703456,081,275428,136,0001,000,0002,375,680
5Feb 22, 2026 21:2951,711452,219,104427,204,0002,000,0002,404,352
6Feb 22, 2026 21:2951,711456,842,673426,200,0003,001,0002,277,376
7Feb 22, 2026 21:2951,736456,519,382427,411,0002,001,0002,277,376
8Feb 22, 2026 21:2951,753455,888,998427,544,0002,002,0002,277,376
9Feb 22, 2026 21:2951,764455,731,630427,644,0001,998,0002,523,136