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 8, 2025 11:39j3o1j3o1Score: 138,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 11:39137,9781,176,029,9791,143,219,0001,998,0002,285,568
2Nov 8, 2025 11:39138,1031,172,786,5371,144,258,0001,998,0002,277,376
3Nov 8, 2025 11:39139,6071,190,956,0191,157,740,000999,0002,523,136