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 listAug 12, 2026 00:31Victor MerckléVictor MerckléScore: 6,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 00:366,26260,186,73850,911,0001,065,0002,117,632stderr
2Aug 12, 2026 00:366,26660,165,58350,940,0001,076,0002,117,632stderr
3Aug 12, 2026 00:366,28860,379,13451,079,0001,112,0002,117,632stderr
4Aug 12, 2026 00:366,30560,508,11851,308,0001,030,0002,117,632stderr
5Aug 12, 2026 00:366,32360,744,38651,300,0001,188,0002,117,632stderr
6Aug 12, 2026 00:366,33560,799,33951,571,0001,010,0002,117,632stderr
7Aug 12, 2026 00:366,41761,555,55752,229,0001,039,0002,117,632stderr
8Aug 12, 2026 00:366,50362,301,90552,942,0001,034,0002,117,632stderr
9Aug 12, 2026 00:366,65063,448,58154,180,0001,017,0002,117,632stderr