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 10, 2026 17:24Daniel MastalerzDaniel MastalerzScore: 8,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 17:248,47393,177,81966,311,0004,018,0002,314,240
2Feb 10, 2026 17:248,47695,624,29965,327,0005,025,0002,314,240
3Feb 10, 2026 17:248,53393,660,41365,835,0004,987,0002,400,256