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 1, 2025 07:51mebowlermebowlerScore: 113,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 07:51113,211966,722,435892,670,00046,982,0002,531,328
2Feb 1, 2025 07:51113,461965,389,429881,746,00059,982,0002,363,392
3Feb 1, 2025 07:51113,481966,980,239898,897,00042,995,0002,527,232