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 19:52Rajarshi BasuRajarshi BasuScore: 25,601Success
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 19:5225,495241,025,896210,611,000998,0002,273,280
2Nov 29, 2025 19:5225,601235,888,770212,485,00002,265,088
3Nov 29, 2025 19:5226,356247,920,556217,758,000998,0002,523,136