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 20, 2026 18:10Daniel MastalerzDaniel MastalerzScore: 5,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 18:105,80776,470,97347,195,0001,004,0002,502,656
2Feb 20, 2026 18:105,81770,625,93447,273,0001,005,0002,289,664
3Feb 20, 2026 18:105,82076,133,84046,294,0002,012,0002,289,664