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 16, 2026 09:03wnwnScore: 8,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 09:037,20586,369,11650,834,0008,970,0002,482,176
2Feb 16, 2026 09:117,23682,822,40851,049,0009,008,0002,449,408
3Feb 16, 2026 09:117,24485,143,37353,111,0007,014,0002,420,736
4Feb 16, 2026 09:117,29886,774,03854,516,0006,057,0002,457,600
5Feb 16, 2026 09:037,30689,784,03552,552,0008,084,0002,478,080
6Feb 16, 2026 09:037,38383,630,91651,233,00010,045,0002,461,696
7Feb 16, 2026 09:118,34594,860,04860,230,0009,034,0002,428,928
8Feb 16, 2026 09:038,380101,582,38361,489,0008,064,0002,383,872
9Feb 16, 2026 09:038,39096,080,45864,591,0005,046,0002,355,200
10Feb 16, 2026 09:118,47198,240,06461,271,0009,039,0002,449,408
11Feb 16, 2026 09:118,55497,607,33560,002,00011,000,0002,461,696
12Feb 16, 2026 09:038,645100,565,42061,791,0009,966,0002,355,200