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 18, 2026 17:28wnwnScore: 7,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 17:286,28676,385,84150,167,0002,006,0002,482,176
2Feb 18, 2026 17:286,42680,364,41651,321,0002,012,0002,473,984
3Feb 18, 2026 17:286,49077,643,30751,870,0001,995,0002,510,848
4Feb 18, 2026 17:287,51792,179,95260,380,0002,012,0002,445,312
5Feb 18, 2026 17:287,52180,994,41859,406,0003,020,0002,383,872
6Feb 18, 2026 17:287,68889,528,90761,817,0001,994,0002,441,216