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 17, 2026 15:54lipapipalipapipaScore: 6,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 15:546,50382,302,61449,980,0003,998,0002,510,848
2Feb 17, 2026 15:546,60581,495,84952,826,0001,993,0002,506,752
3Feb 17, 2026 15:546,61484,963,00353,902,000998,0002,510,848
4Feb 17, 2026 15:546,72380,562,67351,816,0003,985,0002,498,560
5Feb 17, 2026 15:546,73891,931,69352,929,0002,996,0002,523,136
6Feb 17, 2026 15:546,75780,909,72953,080,0003,004,0002,342,912
7Feb 17, 2026 15:546,82788,234,76454,639,0002,023,0002,498,560
8Feb 17, 2026 15:546,84586,538,70453,822,0002,990,0002,408,448
9Feb 17, 2026 15:546,86584,180,69052,985,0003,998,0002,494,464
10Feb 17, 2026 15:546,88077,701,40354,098,0003,005,0002,498,560
11Feb 17, 2026 15:546,88686,132,17956,150,0001,002,0002,494,464
12Feb 17, 2026 15:547,00081,869,02156,100,0002,003,0002,408,448