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 listJan 13, 2025 05:06Advait IyerAdvait IyerScore: 66,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 05:0666,410578,925,000550,207,0001,000,0002,523,136
2Jan 13, 2025 05:0666,421577,960,760549,291,0002,001,0002,277,376
3Jan 13, 2025 05:0666,437582,167,211549,434,0001,997,0002,277,376