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 24, 2026 16:24Daniel MastalerzDaniel MastalerzScore: 5,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:245,64772,121,61742,884,0003,989,0002,330,624
2Feb 24, 2026 16:245,68473,362,46344,164,0003,011,0002,523,136
3Feb 24, 2026 16:245,71069,999,77344,371,0003,025,0002,322,432
4Feb 24, 2026 16:245,72575,424,14644,487,0003,033,0002,285,568
5Feb 24, 2026 16:245,73980,036,08444,596,0003,040,0002,310,144
6Feb 24, 2026 16:246,57977,639,06043,483,00011,123,0002,297,856