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:23Daniel MastalerzDaniel MastalerzScore: 77,857Success
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:2377,840673,059,160641,074,0005,000,0002,318,336
2Feb 10, 2026 17:2377,857674,364,704644,211,0002,000,0002,297,856
3Feb 10, 2026 17:2377,886676,495,608640,458,0005,994,0002,334,720