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 21, 2025 08:51Rajarshi BasuRajarshi BasuScore: 53,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 08:5153,452469,115,701441,653,0001,998,0002,523,136
2Nov 21, 2025 08:5153,454469,180,053441,669,0001,998,0002,523,136
3Nov 21, 2025 08:5153,475465,612,312441,841,0001,999,0002,273,280