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 listDec 16, 2025 06:30Pavitra GolchhaPavitra GolchhaScore: 106,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 06:30106,066903,885,367649,521,000230,829,0002,265,088
2Dec 16, 2025 06:30106,076903,155,068649,581,000230,851,0002,449,408
3Dec 16, 2025 06:30106,142911,745,890648,251,000232,731,0002,412,544