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 listNov 24, 2025 20:49Ham-HamHam-HamScore: 74,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 20:4974,889649,313,654563,615,00057,960,0002,289,664
2Nov 24, 2025 20:4974,895647,984,211559,665,00061,962,0002,281,472
3Nov 24, 2025 20:4974,917643,436,393564,831,00056,983,0002,289,664
4Nov 24, 2025 20:4974,929644,800,369561,922,00059,991,0002,289,664
5Nov 24, 2025 20:4974,935644,966,655563,963,00057,996,0002,289,664
6Nov 24, 2025 20:4974,936643,992,752561,974,00059,997,0002,289,664
7Nov 24, 2025 20:4975,010646,943,479562,621,00059,959,0002,289,664
8Nov 24, 2025 20:4975,014647,081,374561,658,00060,962,0002,289,664
9Nov 24, 2025 20:4975,024644,774,042566,726,00055,972,0002,277,376