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 8, 2026 10:11Daniel MastalerzDaniel MastalerzScore: 26,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 10:1126,664249,777,085218,310,0003,004,0002,273,280
2Feb 8, 2026 10:1126,677253,189,473221,418,00002,269,184
3Feb 8, 2026 10:1126,700248,345,212221,611,00002,285,568