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:10Rajarshi BasuRajarshi BasuScore: 14,188Success
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:1014,139140,303,079102,306,00015,045,0002,469,888
2Dec 6, 2025 08:1014,188150,808,876105,788,00011,976,0002,482,176
3Dec 6, 2025 08:1014,502145,984,209109,334,00011,033,0002,306,048