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 20:01Daniel MastalerzDaniel MastalerzScore: 14,624Success
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 20:0114,503143,888,485118,366,0002,006,0002,326,528
2Feb 10, 2026 20:0114,624147,283,064119,375,0002,006,0002,269,184
3Feb 10, 2026 20:0114,648148,927,728119,584,0001,993,0002,326,528