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 listOct 15, 2024 15:48Elnur RakhmatullinElnur RakhmatullinScore: 84,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 15:4884,258727,972,554623,411,00075,928,0002,281,472
2Oct 15, 2024 15:4884,261728,673,059621,435,00077,929,0002,510,848
3Oct 15, 2024 15:4884,288728,259,274619,639,00079,953,0002,449,408
4Oct 15, 2024 15:4884,361725,980,040623,286,00076,911,0002,269,184
5Oct 15, 2024 15:4884,486731,750,567622,317,00078,913,0002,469,888
6Oct 15, 2024 15:4886,273746,393,414627,058,00089,008,0002,281,472
7Oct 15, 2024 15:4886,315745,466,706628,485,00087,928,0002,510,848
8Oct 15, 2024 15:4886,320742,477,900628,525,00087,933,0002,289,664
9Oct 15, 2024 15:4886,327743,353,943626,574,00089,938,0002,281,472