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 listJun 28, 2026 22:07Victor MerckléVictor MerckléScore: 17,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 22:0817,904156,372,862147,531,0001,076,0002,113,536
2Jun 28, 2026 22:0817,906156,311,771147,512,0001,108,0002,113,536
3Jun 28, 2026 22:0817,933156,953,379147,657,0001,190,0002,113,536
4Jun 28, 2026 22:0817,954156,928,740147,992,0001,029,0002,113,536
5Jun 28, 2026 22:0817,962160,196,589148,042,0001,044,0002,113,536
6Jun 28, 2026 22:0817,964156,772,136148,066,0001,042,0002,113,536
7Jun 28, 2026 22:0817,964156,897,290148,097,0001,012,0002,113,536
8Jun 28, 2026 22:0817,972157,017,263148,077,0001,096,0002,113,536
9Jun 28, 2026 22:0817,985157,144,204148,239,0001,038,0002,113,536