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 listJun 7, 2025 05:34limanjun99limanjun99Score: 50,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2025 05:3450,757443,841,393367,247,00054,036,0002,519,040
2Jun 7, 2025 05:3450,782453,234,888373,550,00047,942,0002,260,992
3Jun 7, 2025 05:3450,796448,802,156369,657,00051,951,0002,359,296
4Jun 7, 2025 05:3450,796445,695,790374,651,00046,956,0002,260,992
5Jun 7, 2025 05:3450,836444,888,771405,939,00015,997,0002,359,296
6Jun 7, 2025 05:3450,866448,064,632363,160,00059,026,0002,363,392
7Jun 7, 2025 05:3450,921450,183,017384,676,00037,968,0002,260,992
8Jun 7, 2025 05:3450,989448,548,323348,172,00075,037,0002,519,040
9Jun 7, 2025 05:3451,041449,801,843371,688,00051,956,0002,510,848