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 listDec 6, 2025 08:45Rajarshi BasuRajarshi BasuScore: 14,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 08:4514,446144,076,628105,916,00013,989,0002,297,856
2Dec 6, 2025 08:4514,590145,070,338107,088,00014,011,0002,306,048
3Dec 6, 2025 08:4514,745147,167,248111,352,00011,034,0002,486,272