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 29, 2025 18:29Rajarshi BasuRajarshi BasuScore: 28,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 18:2928,724265,805,227237,411,0001,001,0002,289,664
2Nov 29, 2025 18:2928,783263,004,126237,901,000999,0002,273,280
3Nov 29, 2025 18:2928,842263,635,722239,390,00002,531,328