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 listSep 29, 2026 09:44wnwnScore: 3,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 09:443,27236,029,05827,159,000020,480
2Sep 29, 2026 09:443,27536,056,37727,188,000020,480
3Sep 29, 2026 09:443,27936,077,90827,217,000020,480
4Sep 29, 2026 09:443,28236,551,87427,246,000020,480
5Sep 29, 2026 09:443,28336,026,12127,253,000020,480
6Sep 29, 2026 09:443,28936,056,46427,300,000020,480
7Sep 29, 2026 09:443,29036,150,22727,314,000020,480
8Sep 29, 2026 09:443,29036,128,99827,314,000020,480
9Sep 29, 2026 09:443,29636,212,72127,363,000020,480