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:08Advait IyerAdvait IyerScore: 66,635Success
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:0866,600580,999,006550,784,0001,999,0002,265,088
2Jan 13, 2025 05:0866,635578,460,678551,071,0002,000,0002,510,848
3Jan 13, 2025 05:0866,641581,529,607551,117,0002,000,0002,277,376