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 9, 2026 20:44Daniel MastalerzDaniel MastalerzScore: 13,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:4413,198139,947,246106,526,0003,014,0002,297,856
2Feb 9, 2026 20:4413,222135,750,607104,752,0004,988,0002,400,256
3Feb 9, 2026 20:4413,225130,705,101104,775,0004,989,0002,490,368