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 listJul 24, 2025 17:54Leon ZhaoLeon ZhaoScore: 66,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2025 17:5466,372577,578,360548,892,0001,999,0002,387,968
2Jul 24, 2025 17:5466,380583,708,117548,959,0001,999,0002,383,872
3Jul 24, 2025 17:5466,434578,084,484550,405,0001,000,0002,519,040
4Jul 24, 2025 17:5466,467578,512,861549,681,0001,998,0002,519,040
5Jul 24, 2025 17:5466,475577,221,740550,740,000999,0002,519,040
6Jul 24, 2025 17:5466,481581,844,306550,792,000999,0002,375,680
7Jul 24, 2025 17:5466,482578,362,142549,799,0001,999,0002,379,776
8Jul 24, 2025 17:5466,487581,188,335549,845,0001,999,0002,383,872
9Jul 24, 2025 17:5466,489576,602,646549,856,0001,999,0002,519,040