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 23, 2026 15:59parastromparastromScore: 6,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 15:596,34963,788,82951,619,0001,080,0002,113,536
2Sep 23, 2026 15:596,48064,951,30152,709,0001,081,0002,113,536
3Sep 23, 2026 15:596,78067,436,91255,188,0001,094,0002,113,536
4Sep 23, 2026 15:596,78166,660,02055,195,0001,095,0002,113,536
5Sep 23, 2026 15:596,78566,834,53955,209,0001,113,0002,113,536
6Sep 23, 2026 15:596,78867,453,50255,255,0001,089,0002,113,536
7Sep 23, 2026 15:596,79667,434,31455,227,0001,180,0002,113,536
8Sep 23, 2026 15:596,86967,347,33955,984,0001,029,0002,113,536
9Sep 23, 2026 15:597,06369,022,24457,443,0001,181,0002,113,536