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 2, 2026 20:52TonyTonyScore: 8,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:538,50780,470,44167,913,0002,703,0002,113,536
2Aug 2, 2026 20:538,52181,202,61068,060,0002,670,0002,113,536
3Aug 2, 2026 20:538,53480,819,15068,197,0002,642,0002,113,536
4Aug 2, 2026 20:538,53480,727,40968,160,0002,678,0002,113,536
5Aug 2, 2026 20:538,53580,781,13668,211,0002,636,0002,113,536
6Aug 2, 2026 20:538,58781,115,03668,640,0002,634,0002,113,536
7Aug 2, 2026 20:538,59081,130,00168,667,0002,636,0002,113,536
8Aug 2, 2026 20:538,60581,296,54168,758,0002,665,0002,113,536
9Aug 2, 2026 20:538,67181,922,45469,870,0002,102,0002,113,536