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 27, 2026 00:10Victor MerckléVictor MerckléScore: 3,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:123,91440,922,35031,465,0001,027,0002,117,632stderr
2Aug 27, 2026 00:123,93341,750,78731,626,0001,026,0002,117,632stderr
3Aug 27, 2026 00:123,94441,061,66031,710,0001,027,0002,117,632stderr
4Aug 27, 2026 00:123,94642,005,88831,739,0001,020,0002,117,632stderr
5Aug 27, 2026 00:123,95641,060,32531,769,0001,073,0002,117,632stderr
6Aug 27, 2026 00:123,95941,132,87131,796,0001,065,0002,117,632stderr
7Aug 27, 2026 00:123,99641,611,20832,082,0001,091,0002,117,632stderr
8Aug 27, 2026 00:124,20843,069,67833,802,0001,126,0002,117,632stderr
9Aug 27, 2026 00:124,20944,093,91533,931,0001,010,0002,117,632stderr