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 09:12Victor MerckléVictor MerckléScore: 6,417Success
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 09:126,35361,092,32851,689,0001,042,0002,113,536
2Aug 27, 2026 09:126,36861,263,21251,769,0001,091,0002,113,536
3Aug 27, 2026 09:126,37561,272,85451,903,0001,011,0002,113,536
4Aug 27, 2026 09:126,41561,616,06552,194,0001,055,0002,113,536
5Aug 27, 2026 09:126,41761,633,88452,205,0001,057,0002,113,536
6Aug 27, 2026 09:126,43961,770,25152,425,0001,022,0002,113,536
7Aug 27, 2026 09:126,50662,385,69852,978,0001,025,0002,113,536
8Aug 27, 2026 09:126,51562,389,88453,069,0001,011,0002,113,536
9Aug 27, 2026 09:126,53163,266,63153,169,0001,039,0002,113,536