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 16, 2026 13:19marko1597marko1597Score: 5,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 16, 2026 13:495,39454,836,28143,622,0001,153,0002,113,536
2Aug 16, 2026 13:495,39655,533,89343,630,0001,157,0002,113,536
3Aug 16, 2026 13:495,41354,948,94743,790,0001,142,0002,113,536
4Aug 16, 2026 13:495,41654,978,34943,801,0001,154,0002,113,536
5Aug 16, 2026 13:495,41755,013,25143,902,0001,062,0002,113,536
6Aug 16, 2026 13:495,41955,285,64043,832,0001,147,0002,113,536
7Aug 16, 2026 13:495,41956,080,61743,877,0001,106,0002,113,536
8Aug 16, 2026 13:495,42655,824,51843,880,0001,164,0002,113,536
9Aug 16, 2026 13:495,44555,928,99544,134,0001,062,0002,113,536