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 11, 2026 19:24olliecrowolliecrowScore: 6,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:245,77177,184,01242,907,0004,989,0002,265,088
2Feb 11, 2026 19:245,79076,997,34345,050,0003,003,0002,314,240
3Feb 11, 2026 19:245,88976,843,29541,898,0006,983,0002,416,640
4Feb 11, 2026 19:246,31480,662,55244,345,0008,062,0002,408,448
5Feb 11, 2026 19:246,31480,682,81644,346,0008,063,0002,490,368
6Feb 11, 2026 19:246,46780,920,75949,698,0003,975,0002,433,024