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 19, 2026 23:29Daniel MastalerzDaniel MastalerzScore: 5,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:295,76178,017,91143,833,0003,984,0002,265,088
2Feb 19, 2026 23:295,76173,422,54144,827,0002,988,0002,265,088
3Feb 19, 2026 23:295,77878,539,25344,959,0002,997,0002,273,280